Consensus-based Approach to Distributed Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Entropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملSupport-Based Distributed Optimisation: An Approach To Radiotherapy Patient Scheduling
In the health system inefficiency leads to poor use of scarce expensive resources. Lengthy patient treatment waiting time can result from inefficiency in scheduling. The use of state-of-the art multi-agent and distributed computing technologies can provide a solution to address this problem. However, distributed optimisation in such a multi-agent setting poses an important challenge that requir...
متن کاملSupport-Based Distributed Optimisation: An Approach to Radiotherapy Scheduling
The public health system is plagued by inefficient use of resources. Frequently, the results are lengthy patient treatment waiting times. While many solutions for patient scheduling in health systems exist, few address the problem of coordination between independent autonomous departments. In this study, we describe the use of a distributed dynamic constraint optimisation algorithm (Support Bas...
متن کاملA Multiagent-Based Approach to the Grid-Scheduling Problem
Computer grids are systems containing heterogeneous, autonomous and geographically distributed nodes. The proper functioning of a grid depends mainly on the efficient management of grid resources to carry out the various jobs that users send to the grid. This paper proposes an algorithm that uses intelligent agents in each node to perform global scheduling in a collaborative and coordinated way...
متن کاملPseudo-scheduling: A New Approach to the Broadcast Scheduling Problem
The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible. This can be naturally modeled as a graph coloring problem via distance-2 coloring (L(1, 1)-labeling, strict scheduling). This coloring is difficult to compute and may require a number of col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Shisutemu Seigyo Jo?ho? Gakkai ronbunshi
سال: 2021
ISSN: ['1342-5668', '2185-811X']
DOI: https://doi.org/10.5687/iscie.34.58